Breadth-first search - PDFSEARCH.IO - Document Search Engine

Breadth-first search
Results: 170

#	Item
141	2178 AND ALL THAT N. J. A. SLOANE Abstract. For integers g ≥ 3, k ≥ 2, call a number N a (g, k)-reverse multiple if the reversal of N in base g is equal to k times N . The numbers 1089 and 2178 are the two smallest ( Add to Reading List Source URL: neilsloane.com Language: English - Date: 2013-10-13 15:00:24 Directed graph Line graph Tree Binary tree Breadth-first search Graph theory Graph operations Graph
142	doi:[removed][removed]Distributed Selection: A Missing Piece of Data Aggregation By Fabian Kuhn, Thomas Locher, and Roger Wattenhofer Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2009-04-08 05:02:23 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Selection algorithm B-tree Breadth-first search Connectivity Time complexity Algorithm Theoretical computer science Applied mathematics Computational complexity theory
143	Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs Fabian Kuhn1 , Thomas Moscibroda1 , Tim Nieberg2? , and Roger Wattenhofer1 1 Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-07-24 07:43:23 NP-complete problems Analysis of algorithms Probabilistic complexity theory Randomized algorithm Connectivity Topology Unit disk graph Graph coloring Breadth-first search Graph theory Theoretical computer science Mathematics
144	Tight Bounds for Distributed Selection Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich, Switzerland Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2007-04-02 04:50:42 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Selection algorithm B-tree Breadth-first search Time complexity Self-organizing list Tango tree Theoretical computer science Computational complexity theory Applied mathematics
145	Notes on Graph Algorithms Used in Optimizing Compilers Carl D. Offner University of Massachusetts Boston March 31, 2013 Add to Reading List Source URL: www.cs.umb.edu Language: English - Date: 2013-03-31 18:04:53 Search algorithms Topological sorting Depth-first search Graph Directed graph Tree traversal Directed acyclic graph Tree Breadth-first search Graph theory Mathematics Combinatorics
146	A Novel Algorithm for Detecting Protein Complexes with the Breadth First Search Add to Reading List Source URL: www.ncbi.nlm.nih.gov Language: English Systems biology Multiprotein complex Interactome Biological network Proteomics Protein–protein interaction Tandem Affinity Purification Biology Bioinformatics Science
147	Minimizing Disk I/O in Two-Bit Breadth-First Search Add to Reading List Source URL: www.aaai.org Language: English - Date: 2008-06-08 00:43:43 Trie Mathematics Tower of Hanoi Bit array Breadth-first search Lookup table Parallel computing Arrays Computing Computer programming
148	WWW[removed]Track: Data Mining Session: Mining in Social Networks Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2007-09-09 13:16:17 Coding theory Belief propagation Probability theory Breadth-first search Factor graph Internet fraud Topology Connectivity Graph database Graph theory Graphical models Mathematics
149	State Spaces Graph Search Add to Reading List Source URL: www.cs.ubc.ca Language: English - Date: 2012-06-29 04:25:59 Graph Path decomposition Breadth-first search Graph theory Mathematics Theoretical computer science
150	IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, VOL. XX, NO. Y, MONTH[removed] Add to Reading List Source URL: pub1.willowgarage.com Language: English - Date: 2008-11-06 17:40:53 Theoretical computer science Incremental heuristic search Breadth-first search Shortest path problem A* search algorithm Sven Koenig Distance D* Graph Graph theory Search algorithms Mathematics

UPDATE